Monte Carlo Optimization Approach for Decentralized Estimation Networks Under Communication Constraints

نویسندگان

  • Murat Üney
  • Müjdat Çetin
چکیده

We consider designing decentralized estimation schemes over bandwidth limited communication links with a particular interest in the tradeoff between the estimation accuracy and the cost of communications due to, e.g., energy consumption. We take two classes of in–network processing strategies into account which yield graph representations through modeling the sensor platforms as the vertices and the communication links by edges as well as a tractable Bayesian risk that comprises the cost of transmissions and penalty for the estimation errors. This approach captures a broad range of possibilities for “online” processing of observations as well as the constraints imposed and enables a rigorous design setting in the form of a constrained optimization problem. Similar schemes as well as the structures exhibited by the solutions to the design problem has been studied previously in the context of decentralized detection. Under reasonable assumptions, the optimization can be carried out in a message passing fashion. We adopt this framework for estimation, however, the corresponding optimization schemes involve integral operators that cannot be evaluated exactly in general. We develop an approximation framework using Monte Carlo methods and obtain particle representations and approximate computational schemes for both classes of in–network processing strategies and their optimization. The proposed Monte Carlo optimization procedures operate in a scalable and efficient fashion and, owing to the non-parametric nature, can produce results for any distributions provided that samples can be produced from the marginals. In addition, this approach exhibits graceful degradation of the estimation accuracy asymptotically as the communication becomes more costly, through a parameterized Bayesian risk. Index Terms Decentralized estimation, communication constrained inference, random fields, message passing algorithms, graphical models, Monte Carlo methods, wireless sensor networks, in-network processing, collaborative signal and information processing. Murat Üney is with the Computer Vision and Pattern Analysis Lab., Signal and Information Processing Group, Sabancı University, OrhanlıTuzla 34956 İstanbul, Turkey ( e-mail: [email protected]). Müjdat Çetin is with the Faculty of Engineering and Natural Sciences, Sabancı University, Orhanlı-Tuzla 34956 İstanbul, Turkey ( e-mail: [email protected]). This work was partially supported by the Scientific and Technological Research Council of Turkey under grant 105E090, by the European Commission under grant MIRG-CT-2006-041919 and with a Turkish Academy of Sciences Young Scientist Award. TECHNICAL REPORT SABANCI UNIVERSITY 2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of decentralized random field estimation networks under communication constraints through Monte Carlo methods

We propose a new methodology for designing decentralized random field estimation schemes for sensor networks that take the tradeoff between the estimation accuracy and the cost of communications into account. We consider a scenario in which each node makes measurements induced by its local spatial variables and can perform bandwidth limited local two-way communications with other nodes located ...

متن کامل

Consensus based Decentralized Sparse Bayesian Learning for Joint Sparse Signal Recovery

This work proposes a decentralized, iterative, Bayesian algorithm called CB-DSBL for in-network estimation of multiple jointly sparse vectors by a network of nodes, using noisy and underdetermined linear measurements. The proposed algorithm exploits the network wide joint sparsity of the unknown sparse vectors to recover them from significantly fewer number of local measurements compared to sta...

متن کامل

Decentralized State Initialization with Delay Compensation for Multi-modal Sensor Networks

Decentralized processing algorithms are attractive alternatives to centralized algorithms for target tracking applications in smart sensor networks since they provide the ability to scale, reduce vulnerability, reduce communication, and share processing responsibilities among individual nodes. Sharing the processing responsibilities allows parallel processing of raw data at the individual nodes...

متن کامل

Application of the Monte-Carlo Method to Nonlinear Stochastic Optimization with Linear Constraints

We consider a problem of nonlinear stochastic optimization with linear constraints. The method of ε-feasible solution by series of Monte-Carlo estimators has been developed for solving this problem avoiding “jamming” or “zigzagging”. Our approach is distinguished by two peculiarities: the optimality of solution is tested in a statistical manner and the Monte-Carlo sample size is adjusted so as ...

متن کامل

Distributed Computation of the Conditional PCRLB for Quantized Decentralized Particle Filters

The conditional posterior Cramér-Rao lower bound (PCRLB) is an effective sensor resource management criteria for large, geographically distributed sensor networks. Existing algorithms for distributed computation of the PCRLB (dPCRLB) are based on raw observations leading to significant communication overhead to the estimation mechanism. This letter derives distributed computational techniques f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010